Tree inclusion problems
نویسندگان
چکیده
Given two trees (a target T and a pattern P ) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjacent to v are also deleted, and outgoing edges are replaced by edges going from the parent of v (if it exists) to the children of v). Deciding whether P is an embedded subtree of T is known to be NP-complete. Our algorithms run in time O(|T |2 |P | ) where |T | (resp. |P |) is the size of T (resp. P ). 1991 Mathematics Subject Classification. 68Q25, 68W05. For 60th birthday of Serge Grigorieff
منابع مشابه
On Weight-Biased Mutation for Graph Problems
Many graph problems seek subgraphs of minimum weight that satisfy the problems’ constraints. Examples include the degreeconstrained minimum spanning tree and traveling salesman problems. Low-weight edges predominate in optimal solutions to these problems, and the performance of evolutionary algorithms for them is often improved by biasing their operators to favor these edges. From the distribut...
متن کاملFast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
We give an O∗(2k)-time algorithm for STEINER TREE using polynomial space, where k is the number of terminals. To obtain this result, we apply Möbius inversion, also known as Inclusion-Exclusion, to the famous Dreyfus-Wagner recurrence. Among our results are also polynomial-space O∗(2n) algorithms for several NP-complete spanning tree and partition problems. With these results, we solve open pro...
متن کاملSimulations and Antichains for Efficient Handling of Finite Automata
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well...
متن کاملCounting Problems and the Inclusion-Exclusion Principle
In this paper, we present improved techniques for computing and getting bounds on the cardinality of a union of sets using the inclusion-exclusion principle and Bonferroni inequalities. We organize the terms involved in the inclusionexclusion sum as a tree, showing that a set inclusion between a parent and its children yields a cancellation, where we may prune an entire subtree. Next, we provid...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملThe Parameterized Complexity of Chosen Problems for Finite Automata on Trees
There are many decision problems in automata theory (including membership, emptiness, emptiness of intersection, inclusion and universality problems) that for some classes of tree automata are NP-hard. The study of their parameterized complexity allows us to find new bounds of their non-polynomial time algorithmic behaviors. We present results of such a study for classical tree automata (TA), r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 42 شماره
صفحات -
تاریخ انتشار 2008